Geometric Objects with a More Combinatorial Flavor
نویسندگان
چکیده
OF HONORS THESIS GEOMETRIC OBJECTS WITH A MORE COMBINATORIAL FLAVOR We are studying geometric objects, defined over finite fields, with a more combinatorial flavor and present the results of the investigation of classification problems in geometry and combinatorics. Objects called BLT-sets, living in a vector space over a finite field, are of great interest to finite geometry, as they provide access to most of the objects that have been studied for a long time (translation planes, generalized quadrangles, flocks). On the other hand, there are objects that are invariant under a Finite group. An example are the Coxeter groups, which act as symmetry groups of root systems, and have been classified. They turn out as symmetry groups of BLT-sets. Andreea Erciulescu Department of Mathematics Colorado State University Fort Collins, Colorado 80523 Spring 2011
منابع مشابه
Geometric Arrangements: Substructures and Algorithms
In this thesis we study a variety of problems in computational and combinatorial geometry, which involve arrangements of geometric objects in the plane and in higher dimensions. Some of these problems involve the design and analysis of algorithms on arrangements and related structures, while others establish combinatorial bounds on the complexity of various substructures in arrangements. Inform...
متن کاملAlgebraic and geometric methods in enumerative combinatorics
Enumerative combinatorics is about counting. The typical question is to find the number of objects with a given set of properties. However, enumerative combinatorics is not just about counting. In “real life”, when we talk about counting, we imagine lining up a set of objects and counting them off: 1, 2, 3, . . .. However, families of combinatorial objects do not come to us in a natural linear ...
متن کاملA Note on the Combinatorial Structure of the Visibility Graph in Simple Polygons
Combinatorial structure of visibility is probably one of the most fascinating and interesting areas of engineering and computer science. The usefulness of visibility graphs in computational geometry and robotic navigation problems like motion planning, unknown-terrain learning, shortest-path planning, etc., cannot be overstressed. The visibility graph, apart from being an important data structu...
متن کاملHomotopy Conditions for Tolerant Geometric Queries
Algorithms for many geometric queries rely on representations that are comprised of combinatorial (logical, incidence) information, usually in a form of a graph or a cell complex, and geometric data that represents embeddings of the cells in the Euclidean space E. Whenever geometric embeddings are imprecise, their incidence relationships may become inconsistent with the associated combinatorial...
متن کاملMatching of Polygon Objects by Optimizing Geometric Criteria
Despite the semantic criteria, geometric criteria have different performances on polygon feature matching in different vector datasets. By using these criteria for measuring the similarity of two polygons in all matchings, the same results would not have been obtained. To achieve the best matching results, the determination of optimal geometric criteria for each dataset is considered necessary....
متن کامل